MORE COMPLETE TITLES
نویسندگان
چکیده
منابع مشابه
Titles More Attractive for Citations ? Cross - sectional Study of 22
Methods Title and the number of citations to all articles published in 2005 in 22 arbitrarily chosen English-language journals (n = 9031) were retrieved from citation database Scopus. The 2008 journal impact factors of these 22 journals were also retrieved from Thomson Reuters’ Journal Citation Report (JCR). Assuming the article title length as the independent variable, and the number of citati...
متن کاملTitles
This is not about knights and dames, nor is it about jazz musicians, such as Duke Ellington or Court Basie. Rather, it is about a most important issue in science, which is the difficult task of choosing titles for seminars, lectures, scientific papers, books and even the titles of the journals themselves. Today, we all have to compete for readers and listeners, and in the current ruthlessly com...
متن کاملA More Complete TLA
This paper defines a generalization of Lamport’s Temporal Logic of Actions. We prove that our logic is stuttering-invariant and give an axiomatization of its propositional fragment. We also show that standard TLA is as expressive as our extension once quantification over flexible propositions is added.
متن کاملMore complete intersection theorems
The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families. In recent work, we extended this theorem to the weighted setting, giving the maximum μp measure of a t-intersecting family on n points. In this work, we prove two new complete intersection theorems. The first gi...
متن کاملToward a More Complete Alloy
Many model-finding tools, such as Alloy, charge users with providing bounds on the sizes of models. It would be preferable to automatically compute sufficient upper-bounds whenever possible. The Bernays-Schönfinkel-Ramsey fragment of first-order logic can relieve users of this burden in some cases: its sentences are satisfiable iff they are satisfied in a finite model, whose size is computable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 1917
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.45.1156.190